Unifying overloading and λ - abstraction : λ fg Giuseppe Castagna

Overloading, subtyping and late binding - functional foundation of object-oriented programming

کارایی روش شماره منحنی رواناب (CN- SCS ) در برآورد رواناب در حوزه آبخیز تهم چای، شمال غرب زنجان

The Soil Conservation Service Curve Number (SCS-CN) method is widely used for predicting direct runoff from rainfall events. The ratio of initial abstraction (λ=Ia/S) to maximum potential retention (S) was assumed in its original development to be equal to 0.2 (λ=Ia/S=0.2) in SCS-CN method. Application of the initial abstraction ratio equal to 0.2 out of the area where it has been developed may...

A semantics for λ { } str : a calculus with overloading and late - binding

Up to now there was no interpretation available for λ-calculi featuring overloading and late-binding, although these are two of the main principles of any object-oriented programming language. In this paper we provide a new semantics for a stratified version of Castagna’s λ{}, a λ-calculus combining overloading with late-binding. The model-construction is carried out in EETJ + (Tot) + (F-IN), a...

Encoding CDuce in the Cpi-Calculus

We present a type faithful encoding of CDuce into the Cπ-calculus. These calculi are two variants of, respectively, the λ-calculus and the π-calculus, characterised by rich typing and subtyping systems with union, negation, and intersection types. The encoding is interesting because it sheds new light on the Milner-Turner encoding, on the relations between sequential and remote execution of fun...

Karlin’s Basic Composition Theorems and Stochastic Orderings

Suppose λ,x,ζ traverse the ordered sets Λ, X and Z, respectively and consider the functions f(λ,x,ζ) and g(λ,ζ) satisfying the following conditions, (a) f(λ,x,ζ) > 0 and f is TP2 in each pairs of variables when the third variable is held fixed and (b) g(λ,ζ) is TP2. Then the function h(λ,x) =∫Z f(λ,x,ζ)g(λ,ζ)dµ(ζ), defined on Λ×X is TP2 in (λ,x). The aim of this note is to use a new stochast...